On the Use of Genetic Algorithms to Fine-tune OSPF Routing

نویسنده

  • Antoine B. Bagula
چکیده

This paper revisits the problem of Traffic Engineering (TE) to evaluate the performance improvements achieved by destination-based TE when OSPF routing is fine-tuned to achieve route optimisation. We build upon the framework provided by evolutionary algorithms to present a TE model where link weights are computed by a genetic algorithm and used as fine-tuning parameters in destination-based path selection. The TE model is based on a hybrid scheme combing offline estimation of the link weights and online path selection. We apply the newly proposed TE model to compute the routing paths for the traffic offered to a 23-node test network. We compare the correlation between the link weights found by the genetic algorithm and the recently proposed Least Path Interference algorithm (LPIA) and evaluate the impact of this correlation on the network performance. We evaluate the routing performance of the TE model using the NS packet level simulator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multicast computer network routing using genetic algorithm and ant colony

Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...

متن کامل

Multi-objective evolutionary algorithms for a preventive healthcare facility network design

Preventive healthcare aims at reducing the likelihood and severity of potentially life-threatening illnesses by protection and early detection. In this paper, a bi-objective mathematical model is proposed to design a network of preventive healthcare facilities so as to minimize total travel and waiting time as well as establishment and staffing cost. Moreover, each facility acts as M/M/1 queuin...

متن کامل

Analysis of enhanced OSPF for routing lightpaths in optical mesh networks

We discuss enhancements to the OSPF protocol for routing and topology discovery in optical mesh networks. OSPF’s opaque LSA mechanism is used to extend OSPF to disseminate optical resource related information through optical LSAs. Standard link-state database flooding mechanisms are used for distribution of optical LSAs. Each optical LSA carries optical resource information pertaining to a sing...

متن کامل

Presentation of algorithm for a full proximate flat surface optimum padding included obstacles with use routing algorithms

This article proposes a new planning navigation strategy for use with mobile terrestrial robots. The proposed algorithm is applicable in any point of the areas for tasks such as cleaning the floors of building, mowing and clearing mined areas. The strategy of this algorithm is analyzed and checked in conditions where the environment and the obstacles are known. There are various routing algorit...

متن کامل

Optimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms

Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005